Construction and number of self-dual skew codes over $\mathbb{F}_{p^2}$
نویسندگان
چکیده
منابع مشابه
Construction and number of self-dual skew codes over F_p2
The aim of this text is to construct and to enumerate self-dual θ-cyclic and θ-negacyclic codes over IFp2 where p is a prime number and θ is the Frobenius automorphism.
متن کاملConstruction of Self - Dual Codes over F
We present two kinds of construction methods for self-dual codes over F2 + uF2. Specially, the second construction (respectively, the first one) preserves the types of codes, that is, the constructed codes from Type II (respectively, Type IV) is also Type II (respectively, Type IV). Every Type II (respectively, Type IV) code over F2 + uF2 of free rank larger than three (respectively, one) can b...
متن کاملSelf-dual skew codes and factorization of skew polynomials
The construction of cyclic codes can be generalized to so-called ”module θ-codes” using noncommutative polynomials. The product of the generator polynomial g of a self-dual ”module θ-code” and its ”skew reciprocal polynomial” is known to be a noncommutative polynomial of the form X − a, reducing the problem of the computation of all such codes to the resolution of a polynomial system where the ...
متن کاملConstruction of MDS self-dual codes over Galois rings
The purpose of this paper is to construct nontrivial MDS self-dual codes over Galois rings. We consider a building-up construction of self-dual codes over Galois rings as a GF(q)-analogue of [20]. We give a necessary and sufficient condition on which the building-up construction holds. We construct MDS self-dual codes of lengths up to 8 over GR(3, 2), GR(3, 2) and GR(3, 2), and near-MDS self-du...
متن کاملConstruction of Self-dual Codes over $F_p+vF_p$
In this paper, we determine all self-dual codes over Fp + vFp (v 2 = v) in terms of self-dual codes over the finite field Fp and give an explicit construction for self-dual codes over Fp + vFp, where p is a prime.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2016
ISSN: 1930-5346
DOI: 10.3934/amc.2016040